Optimization of the COVID-19 Vaccine Distribution Route Using the Vehicle Routing Problem with Time Windows Model and Capacity Constraint

نویسندگان

چکیده

At this time the effectiveness of COVID-19 vaccines has been proven, and it is crucial to carry out complete vaccination population. Therefore, imperative optimize vaccine distribution fleets. This paper discusses optimization routes for Pfizer in Portugal terms transportation time, total costs, CO2 emissions. To end, Vehicle Routing Problem with Time Windows (VRPTW) model a vehicle capacity restriction was used. The VRPTW tested two scenarios. first scenario allowed driver work overtime (585 min). second considered that works 8 h (480 results are presented compare justify proposed method large significance placed safety concerns, economic savings, environmental protection, energy consumption. aims contribute healthcare system by optimizing minimizing process’s carbon footprint.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...

متن کامل

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

متن کامل

The Vehicle Routing Problem with Time Windows: Minimizing Route Duration

We investigate the implementation of edge-exchange improvement methods for the vehicle routing problem with time windows with minimization of route duration as the objective. The presence of time windows as well as the chosen objective cause verification of the feasibility and profitability of a single edge-exchange to require an amount of computing time that is linear in the number of vertices...

متن کامل

A goal programming model for vehicle routing problem with backhauls and soft time windows

The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...

متن کامل

Acceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows

The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied system innovation

سال: 2023

ISSN: ['2571-5577']

DOI: https://doi.org/10.3390/asi6010017